Factorizations of Coxeter Elements in Complex Reflection Groups
نویسنده
چکیده
In [CS12], Chapuy and Stump studied factorizations of Coxeter elements into products of reflections in well-generated, irreducible complex reflection groups, giving a simple closed form expression for their exponential generating function depending on certain natural parameters. In this work, their methods are used to consider a more general multivariate generating function FACW (u1, . . . , u`) in which the number of reflections from each hyperplane orbit is recorded. This generating function takes a similar simple form which can be stated uniformly for well-generated irreducible complex reflection groups in terms of certain data associated to orbits of reflecting hyperplanes, and specializes to that of Chapuy and Stump. A consequence of this more refined generating function – that the Coxeter number of any well-generated complex reflection group W is determined by certain data associated to any W -orbit of reflecting hyperplanes– is stated, and a case-free argument is given for real reflection groups.
منابع مشابه
Counting factorizations of Coxeter elements into products of reflections
In this paper, we count factorizations of Coxeter elements in wellgenerated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factorizations, which is expressed uniformly in terms of natural parameters of the group. In the case of factorizations of minimal length, we recover a formula due to P. Deligne, J. ...
متن کاملA Refined Count of Coxeter Element Reflection Factorizations
For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections used from each orbit of hyperplanes. The proof is case-by-case via the classification of well-generated groups. It implies a new expression for the Coxeter ...
متن کاملExplicit Presentations for Exceptional Braid Groups
To any complex reflection group W ⊂ GL(V ), one may attach a braid group B(W ), defined as the fundamental group of the space of regular orbits for the action of W on V [Broué et al. 98]. The “ordinary” braid group on n strings, introduced by [Artin 47], corresponds to the case of the symmetric group Sn, in its monomial reflection representation in GLn(C). More generally, any Coxeter group can ...
متن کاملBounding Reflection Length in an Affine Coxeter Group
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we prove that the reflection length function on an affine Coxeter group has a uniform upper bound. More precisely we prove that the reflection length function on...
متن کاملClimbing Elements in Finite Coxeter Groups
We define the notion of a climbing element in a finite real reflection group relative to a total order on the reflection set and we characterise these elements in the case where the total order arises from a bipartite Coxeter element.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017